Constrained Infinite Group Relaxations of MIPs Santanu
نویسندگان
چکیده
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to this stronger relaxation and characterize the extreme inequalities when there are two integer variables. 1 Université catholique de Louvain, CORE, B-1348 Louvain-la-Neuve, Belgium. E-mail: [email protected] 2 Université catholique de Louvain, CORE and INMA, B-1348 Louvain-la-Neuve, Belgium. E-mail: [email protected]. This author is also member of ECORE, the association between CORE and ECARES. We would like to thank Ellis Johnson for a motivating discussion and pointing out references [11] and [19]. We would also like to thank Amitabh Basu, Gerard Cornuéjols Michele Conforti, and Giacomo Zambelli for pointing out corrections to the statements of Proposition 2.1 and Proposition 6.3. This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The scientific responsibility is assumed by the authors.
منابع مشابه
Constrained Infinite Group Relaxations of MIPs
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation. We generalize a number of results for the continuous infinite group relaxation to...
متن کاملOn the extreme inequalities of infinite group problems
Infinite group relaxations of integer programs (IP) were introduced by Gomory and Johnson [10] to generate cutting planes for general IPs. These valid inequalities correspond to real-valued functions defined over an appropriate infinite group. Among all the valid inequalities of the infinite group relaxation, extreme inequalities are most important since they are the strongest cutting planes th...
متن کاملRelations between facets of low- and high-dimensional group problems
One-dimensional infinite group problems have been extensively studied and have yielded strong cutting planes for mixed integer programs. Although numerical and theoretical studies suggest that group cuts can be significantly improved by considering higher-dimensional groups, there are no known facets for infinite group problems whose dimension is larger than two. In this paper, we introduce an ...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملTwo dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
In this paper, we study the relationship between 2D lattice-free cuts, the family of cuts obtained by taking two-row relaxations of a mixed-integer program (MIP) and applying intersection cuts based on maximal lattice-free sets in R, and various types of disjunctions. Recently, Li and Richard (2007) studied disjunctive cuts obtained from t-branch split disjunctions of mixed-integer sets (these ...
متن کامل